Power law dynamics in genealogical graphs
نویسندگان
چکیده
Several populational networks present complex topologies when implemented in evolutionary algorithms. A common feature of these is the emergence a power law. Power law behavior with different scaling factors can also be observed genealogical networks, but we still not satisfactorily describe its dynamics or relation to population evolution over time. In this paper, use an algorithm measure impact individuals several numerical populations and study through nonextensive statistics. Like this, show evidence that has dynamic This development described using family q-exponential distributions whose parameters are time-dependent follow specific pattern. We elitism significantly influences observed. These results imply shapes deviations static images distributions.
منابع مشابه
Drawing Power Law Graphs
We present methods for drawing graphs that arise in various information networks. It has been noted that many realistic graphs have power law degree distribution and exhibit the small world phenomenon. Our algorithm is influenced by recent developments on modeling and analysis of such power law graphs.
متن کاملCompact Routing in Power-Law Graphs
We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted random power-law graphs with fixed expected degree sequence by Aiello, Chung, and Lu. Our result is the first theoretical bound coupled to the parameter of the power-law graph model for a compact routing scheme. In particular, we pr...
متن کاملEigenvalues of Random Power Law Graphs
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1 + o(1)) √ m where m is the maximum degree. Moreover, the k largest eigenvalues of a random power law graph with exponent β have power l...
متن کاملDistance Labelings on Random Power Law Graphs
Methods for answering distance queries on large graphs through a preprocessed data structure have a rich history of study. Recent evaluations on social and information networks have shown that there are very efficient landmark based labeling schemes on these networks, even for exact distances. However, it is unclear what are the essential properties of these networks that make short labelings p...
متن کاملEigenvalues of Random Power Law Graphs (DRAFT)
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1+o(1)) √ m where m is the maximum degree. When 2 < β < 2.5, the largest eigenvalue is heavily concentrated at cm3−β for some constant c ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2022
ISSN: ['1872-8022', '0167-2789']
DOI: https://doi.org/10.1016/j.physa.2022.127174